A Parallel Primal-Dual Interior Point Method for Multi-Period and Multi-Facility Production Planning Problems
نویسندگان
چکیده
منابع مشابه
Parallel Primal-dual Interior-point Methods for Semidefinite Programs B-415 Parallel Primal-dual Interior-point Methods for Semidefinite Programs
The Semidefinite Program (SDP) is a fundamental problem in mathematical programming. It covers a wide range of applications, such as combinatorial optimization, control theory, polynomial optimization, and quantum chemistry. Solving extremely large-scale SDPs which could not be solved before is a significant work to open up a new vista of future applications of SDPs. Our two software packages S...
متن کاملBuilding a Multi-Objective Model for Multi-Product Multi-Period Production Planning with Controllable Processing Times: A Real Case Problem
Model building is a fragile and complex process especially in the context of real cases. Each real case problem has its own characteristics with new concepts and conditions. A correct model should have some essential characteristics such as: being compatible with real conditions, being of sufficient accuracy, being logically traceable and etc. This paper discusses how to build an efficient mode...
متن کاملA primal-dual regularized interior-point method for semidefinite programming
Interior-point methods in semidefinite programming (SDP) require the solution of a sequence of linear systems which are used to derive the search directions. Safeguards are typically required in order to handle rank-deficient Jacobians and free variables. We generalize the primal-dual regularization of Friedlander and Orban (2012) to SDP and show that it is possible to recover an optimal soluti...
متن کاملA primal-dual interior point method for nonlinear semidefinite programming
In this paper, we consider a primal-dual interior point method for solving nonlinear semidefinite programming problems. By combining the primal barrier penalty function and the primal-dual barrier function, a new primal-dual merit function is proposed within the framework of the line search strategy. We show the global convergence property of our method.
متن کاملOptimal Crashing of Multi Period-Multi Product Production Planning Problems
To save overhead and penalty costs, in many cases of Multi-Period Multi-Product (MPMP) planning systems, reducing the completion time is highly desirable. Therefore, in this paper we study this problem. We propose an approach in which a MPMP problem is converted into a project management network. Then, considering network concepts and properties, a multi stage novel mathematical model is propos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Institute of Systems, Control and Information Engineers
سال: 2003
ISSN: 1342-5668,2185-811X
DOI: 10.5687/iscie.16.356